0.12/0.13	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.12/0.16	% Command    : eprover-ho %s --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --free-numbers -auto-schedule -p --cpu-limit=%d --neg-ext=all --pos-ext=all --ext-sup-max-depth=2 --schedule-kind=CASC
0.16/0.37	% Computer   : n012.cluster.edu
0.16/0.37	% Model      : x86_64 x86_64
0.16/0.37	% CPU        : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.16/0.37	% Memory     : 8042.1875MB
0.16/0.37	% OS         : Linux 3.10.0-693.el7.x86_64
0.16/0.37	% CPULimit   : 1200
0.16/0.37	% WCLimit    : 120
0.16/0.37	% DateTime   : Tue Jul 13 12:55:31 EDT 2021
0.16/0.37	% CPUTime    : 
0.16/0.37	% Number of cores: 8
0.16/0.38	% Python version: Python 3.6.8
0.16/0.38	# Version: 2.6rc1-ho
0.16/0.39	# No SInE strategy applied
0.16/0.39	# Trying AutoSched0 for 59 seconds
59.15/59.46	# AutoSched0-Mode selected heuristic G_E___303_C18_F1_URBAN_S0Y
59.15/59.46	# and selection function SelectMaxLComplexAvoidPosPred.
59.15/59.46	#
59.15/59.46	# Preprocessing time       : 0.104 s
59.34/59.63	# No success with AutoSched0
59.34/59.63	# Trying AutoSched1 for 26 seconds
85.23/85.65	# AutoSched1-Mode selected heuristic G_E___008_C45_F1_PI_SE_Q4_CS_SP_S4SI
85.23/85.65	# and selection function SelectNewComplexAHPNS.
85.23/85.65	#
85.23/85.65	# Preprocessing time       : 0.089 s
85.36/85.73	# No success with AutoSched1
85.36/85.73	# Trying AutoSched2 for 8 seconds
93.33/93.75	# AutoSched2-Mode selected heuristic U_____100_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_ND_S04AN
93.33/93.75	# and selection function SelectComplexExceptUniqMaxHorn.
93.33/93.75	#
93.33/93.75	# Preprocessing time       : 0.117 s
93.33/93.75	# Presaturation interreduction done
93.42/93.77	# No success with AutoSched2
93.42/93.77	# Trying AutoSched3 for 7 seconds
100.42/100.82	# AutoSched3-Mode selected heuristic G_E___300_C01_S5PRR_S00
100.42/100.82	# and selection function NoSelection.
100.42/100.82	#
100.42/100.82	# Preprocessing time       : 0.088 s
100.42/100.85	# No success with AutoSched3
100.42/100.85	# Trying AutoSched4 for 5 seconds
105.43/105.85	# AutoSched4-Mode selected heuristic G_E___207_C18_F1_SE_CS_SP_PI_PS_S2SI
105.43/105.85	# and selection function SelectNewComplexAHP.
105.43/105.85	#
105.43/105.85	# Preprocessing time       : 0.090 s
105.43/105.85	# Presaturation interreduction done
105.43/105.87	# No success with AutoSched4
105.43/105.87	# Trying AutoSched5 for 3 seconds
108.11/108.56	# AutoSched5-Mode selected heuristic G_E___207_C01_F1_SE_CS_SP_PI_S5PRR_S0Y
108.11/108.56	# and selection function SelectMaxLComplexAvoidPosPred.
108.11/108.56	#
108.11/108.56	# Preprocessing time       : 0.090 s
108.11/108.56	
108.11/108.56	# Proof found!
108.11/108.56	# SZS status Theorem
108.11/108.56	# SZS output start CNFRefutation
108.11/108.56	thf(def_d_not, axiom, (d_not)=(^[X36:$o]:(X36=>~$true)), file('/export/starexec/sandbox/benchmark/Axioms/NUM007^0.ax', def_d_not)).
108.11/108.56	thf(def_imp, axiom, (imp)=(^[X34:$o, X35:$o]:(X34=>X35)), file('/export/starexec/sandbox/benchmark/Axioms/NUM007^0.ax', def_imp)).
108.11/108.56	thf(def_all_of, axiom, (all_of)=(^[X3:$i > $o, X2:$i > $o]:![X4:$i]:(X3 @ X4=>X2 @ X4)), file('/export/starexec/sandbox/benchmark/Axioms/NUM007^0.ax', def_all_of)).
108.11/108.56	thf(def_is_of, axiom, (is_of)=(^[X1:$i, X2:$i > $o]:X2 @ X1), file('/export/starexec/sandbox/benchmark/Axioms/NUM007^0.ax', def_is_of)).
108.11/108.56	thf(def_non, axiom, (non)=(^[X1:$i, X2:$i > $o, X4:$i]:(X2 @ X4=>~$true)), file('/export/starexec/sandbox/benchmark/Axioms/NUM007^0.ax', def_non)).
108.11/108.56	thf(def_l_some, axiom, (l_some)=(^[X1:$i, X2:$i > $o]:(![X474:$i]:(in @ X474 @ X1=>(X2 @ X474=>~$true))=>~$true)), file('/export/starexec/sandbox/benchmark/Axioms/NUM007^0.ax', def_l_some)).
108.11/108.56	thf(def_n_is, axiom, (n_is)=(^[X550:$i, X551:$i]:(X550)=(X551)), file('/export/starexec/sandbox/benchmark/Axioms/NUM007^0.ax', def_n_is)).
108.11/108.56	thf(def_e_is, axiom, (e_is)=(^[X1:$i, X60:$i, X61:$i]:(X60)=(X61)), file('/export/starexec/sandbox/benchmark/Axioms/NUM007^0.ax', def_e_is)).
108.11/108.56	thf(def_l_ec, axiom, (l_ec)=(^[X38:$o, X39:$o]:(X38=>(X39=>~$true))), file('/export/starexec/sandbox/benchmark/Axioms/NUM007^0.ax', def_l_ec)).
108.11/108.56	thf(def_n_some, axiom, (n_some)=(^[X552:$i > $o]:(![X553:$i]:(in @ X553 @ nat=>(X552 @ X553=>~$true))=>~$true)), file('/export/starexec/sandbox/benchmark/Axioms/NUM007^0.ax', def_n_some)).
108.11/108.56	thf(def_diffprop, axiom, (diffprop)=(^[X1:$i, X183:$i, X4:$i]:(X1)=(n_pl @ X183 @ X4)), file('/export/starexec/sandbox/benchmark/theBenchmark.p', def_diffprop)).
108.11/108.56	thf(def_d_and, axiom, (d_and)=(^[X40:$o, X41:$o]:((X40=>(X41=>~$true))=>~$true)), file('/export/starexec/sandbox/benchmark/Axioms/NUM007^0.ax', def_d_and)).
108.11/108.56	thf(def_amone, axiom, (amone)=(^[X1:$i, X2:$i > $o]:![X479:$i]:(in @ X479 @ X1=>![X481:$i]:(in @ X481 @ X1=>(X2 @ X479=>(X2 @ X481=>(X479)=(X481)))))), file('/export/starexec/sandbox/benchmark/Axioms/NUM007^0.ax', def_amone)).
108.11/108.56	thf(def_l_or, axiom, (l_or)=(^[X42:$o, X469:$o]:((X42=>~$true)=>X469)), file('/export/starexec/sandbox/benchmark/Axioms/NUM007^0.ax', def_l_or)).
108.11/108.56	thf(def_d_29_ii, axiom, (d_29_ii)=(^[X1:$i, X184:$i]:(![X574:$i]:(in @ X574 @ nat=>((X1)=(n_pl @ X184 @ X574)=>~$true))=>~$true)), file('/export/starexec/sandbox/benchmark/theBenchmark.p', def_d_29_ii)).
108.11/108.56	thf(def_nis, axiom, (nis)=(^[X1:$i, X113:$i]:((X1)=(X113)=>~$true)), file('/export/starexec/sandbox/benchmark/Axioms/NUM007^0.ax', def_nis)).
108.11/108.56	thf(def_one, axiom, (one)=(^[X1:$i, X2:$i > $o]:((![X482:$i]:(in @ X482 @ X1=>![X483:$i]:(in @ X483 @ X1=>(X2 @ X482=>(X2 @ X483=>(X482)=(X483)))))=>((![X484:$i]:(in @ X484 @ X1=>(X2 @ X484=>~$true))=>~$true)=>~$true))=>~$true)), file('/export/starexec/sandbox/benchmark/Axioms/NUM007^0.ax', def_one)).
108.11/108.56	thf(def_moreis, axiom, (moreis)=(^[X1:$i, X187:$i]:(((![X581:$i]:(in @ X581 @ nat=>((X1)=(n_pl @ X187 @ X581)=>~$true))=>~$true)=>~$true)=>(X1)=(X187))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', def_moreis)).
108.11/108.56	thf(ordsucc_inj, axiom, ![X1:$i, X118:$i]:((X1)=(X118)<=(ordsucc @ X1)=(ordsucc @ X118)), file('/export/starexec/sandbox/benchmark/Axioms/NUM007^0.ax', ordsucc_inj)).
108.11/108.56	thf(satz3, axiom, all_of @ (^[X1:$i]:in @ X1 @ nat) @ (^[X1:$i]:(n_some @ (^[X201:$i]:n_is @ X1 @ (ordsucc @ X201))<=nis @ X1 @ n_1)), file('/export/starexec/sandbox/benchmark/theBenchmark.p', satz3)).
108.11/108.56	thf(def_n_one, axiom, (n_one)=(^[X556:$i > $o]:((![X557:$i]:(in @ X557 @ nat=>![X558:$i]:(in @ X558 @ nat=>(X556 @ X557=>(X556 @ X558=>(X557)=(X558)))))=>((![X559:$i]:(in @ X559 @ nat=>(X556 @ X559=>~$true))=>~$true)=>~$true))=>~$true)), file('/export/starexec/sandbox/benchmark/Axioms/NUM007^0.ax', def_n_one)).
108.11/108.56	thf(satz4e, axiom, all_of @ (^[X1:$i]:in @ X1 @ nat) @ (^[X1:$i]:n_is @ (ordsucc @ X1) @ (n_pl @ X1 @ n_1)), file('/export/starexec/sandbox/benchmark/theBenchmark.p', satz4e)).
108.11/108.56	thf(satz25, conjecture, all_of @ (^[X1:$i]:in @ X1 @ nat) @ (^[X1:$i]:all_of @ (^[X212:$i]:in @ X212 @ nat) @ (^[X213:$i]:(moreis @ X213 @ (n_pl @ X1 @ n_1)<=d_29_ii @ X213 @ X1))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', satz25)).
108.11/108.56	thf(satz3a, axiom, all_of @ (^[X1:$i]:in @ X1 @ nat) @ (^[X1:$i]:(nis @ X1 @ n_1=>n_one @ (^[X312:$i]:n_is @ X1 @ (ordsucc @ X312)))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', satz3a)).
108.11/108.56	thf(satz4f, axiom, all_of @ (^[X1:$i]:in @ X1 @ nat) @ (^[X1:$i]:all_of @ (^[X284:$i]:in @ X284 @ nat) @ (^[X285:$i]:n_is @ (ordsucc @ (n_pl @ X1 @ X285)) @ (n_pl @ X1 @ (ordsucc @ X285)))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', satz4f)).
108.11/108.56	thf(satz4h, axiom, all_of @ (^[X1:$i]:in @ X1 @ nat) @ (^[X1:$i]:all_of @ (^[X276:$i]:in @ X276 @ nat) @ (^[X277:$i]:n_is @ (ordsucc @ (n_pl @ X1 @ X277)) @ (n_pl @ (ordsucc @ X1) @ X277))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', satz4h)).
108.11/108.56	thf(satz6, axiom, all_of @ (^[X1:$i]:in @ X1 @ nat) @ (^[X1:$i]:all_of @ (^[X242:$i]:in @ X242 @ nat) @ (^[X243:$i]:n_is @ (n_pl @ X1 @ X243) @ (n_pl @ X243 @ X1))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', satz6)).
108.11/108.56	thf(satz4g, axiom, all_of @ (^[X1:$i]:in @ X1 @ nat) @ (^[X1:$i]:n_is @ (ordsucc @ X1) @ (n_pl @ n_1 @ X1)), file('/export/starexec/sandbox/benchmark/theBenchmark.p', satz4g)).
108.11/108.56	thf(c_0_28, axiom, (d_not)=(^[X36:$o]:(X36=>~$true)), inference(apply_def,[status(thm)],[def_d_not, def_imp])).
108.11/108.56	thf(c_0_29, axiom, (all_of)=(^[X3:$i > $o, X2:$i > $o]:![X4:$i]:(X3 @ X4=>X2 @ X4)), inference(apply_def,[status(thm)],[def_all_of, def_is_of])).
108.11/108.56	thf(c_0_30, axiom, (non)=(^[X1:$i, X2:$i > $o, X4:$i]:(X2 @ X4=>~$true)), inference(apply_def,[status(thm)],[def_non, c_0_28])).
108.11/108.56	thf(c_0_31, axiom, (l_some)=(^[X1:$i, X2:$i > $o]:(![X474:$i]:(in @ X474 @ X1=>(X2 @ X474=>~$true))=>~$true)), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[def_l_some, c_0_29]), c_0_28]), c_0_30])).
108.11/108.56	thf(c_0_32, axiom, (n_is)=(^[X550:$i, X551:$i]:(X550)=(X551)), inference(apply_def,[status(thm)],[def_n_is, def_e_is])).
108.11/108.56	thf(c_0_33, axiom, (l_ec)=(^[X38:$o, X39:$o]:(X38=>(X39=>~$true))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[def_l_ec, def_imp]), c_0_28])).
108.11/108.56	thf(c_0_34, axiom, (n_some)=(^[X552:$i > $o]:(![X553:$i]:(in @ X553 @ nat=>(X552 @ X553=>~$true))=>~$true)), inference(apply_def,[status(thm)],[def_n_some, c_0_31])).
108.11/108.56	thf(c_0_35, axiom, (diffprop)=(^[X1:$i, X183:$i, X4:$i]:(X1)=(n_pl @ X183 @ X4)), inference(apply_def,[status(thm)],[def_diffprop, c_0_32])).
108.11/108.56	thf(c_0_36, axiom, (d_and)=(^[X40:$o, X41:$o]:((X40=>(X41=>~$true))=>~$true)), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[def_d_and, c_0_28]), c_0_33])).
108.11/108.56	thf(c_0_37, axiom, (amone)=(^[X1:$i, X2:$i > $o]:![X479:$i]:(in @ X479 @ X1=>![X481:$i]:(in @ X481 @ X1=>(X2 @ X479=>(X2 @ X481=>(X479)=(X481)))))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[def_amone, c_0_29]), def_e_is])).
108.11/108.56	thf(c_0_38, axiom, (l_or)=(^[X42:$o, X469:$o]:((X42=>~$true)=>X469)), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[def_l_or, def_imp]), c_0_28])).
108.11/108.56	thf(c_0_39, axiom, (d_29_ii)=(^[X1:$i, X184:$i]:(![X574:$i]:(in @ X574 @ nat=>((X1)=(n_pl @ X184 @ X574)=>~$true))=>~$true)), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[def_d_29_ii, c_0_34]), c_0_35])).
108.11/108.56	thf(c_0_40, axiom, (nis)=(^[X1:$i, X113:$i]:((X1)=(X113)=>~$true)), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[def_nis, c_0_28]), c_0_32])).
108.11/108.56	thf(c_0_41, axiom, (one)=(^[X1:$i, X2:$i > $o]:((![X482:$i]:(in @ X482 @ X1=>![X483:$i]:(in @ X483 @ X1=>(X2 @ X482=>(X2 @ X483=>(X482)=(X483)))))=>((![X484:$i]:(in @ X484 @ X1=>(X2 @ X484=>~$true))=>~$true)=>~$true))=>~$true)), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[def_one, c_0_36]), c_0_31]), c_0_37])).
108.11/108.56	thf(c_0_42, axiom, (moreis)=(^[X1:$i, X187:$i]:(((![X581:$i]:(in @ X581 @ nat=>((X1)=(n_pl @ X187 @ X581)=>~$true))=>~$true)=>~$true)=>(X1)=(X187))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[def_moreis, c_0_38]), c_0_32]), c_0_39])).
108.11/108.56	thf(c_0_43, plain, ![X1:$i, X118:$i]:((ordsucc @ X1)=(ordsucc @ X118)=>(X1)=(X118)), inference(fof_simplification,[status(thm)],[ordsucc_inj])).
108.11/108.56	thf(c_0_44, plain, ![X891:$i]:(in @ X891 @ nat=>((X891)!=(n_1)=>~(![X895:$i]:(in @ X895 @ nat=>(X891)!=(ordsucc @ X895))))), inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[satz3, c_0_29]), c_0_32]), c_0_40]), c_0_34])])).
108.11/108.56	thf(c_0_45, axiom, (n_one)=(^[X556:$i > $o]:((![X557:$i]:(in @ X557 @ nat=>![X558:$i]:(in @ X558 @ nat=>(X556 @ X557=>(X556 @ X558=>(X557)=(X558)))))=>((![X559:$i]:(in @ X559 @ nat=>(X556 @ X559=>~$true))=>~$true)=>~$true))=>~$true)), inference(apply_def,[status(thm)],[def_n_one, c_0_41])).
108.11/108.56	thf(c_0_46, plain, ![X1371:$i]:(in @ X1371 @ nat=>(ordsucc @ X1371)=(n_pl @ X1371 @ n_1)), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[satz4e, c_0_29]), c_0_32])).
108.11/108.56	thf(c_0_47, negated_conjecture, ~(![X1053:$i]:(in @ X1053 @ nat=>![X1059:$i]:(in @ X1059 @ nat=>(~(![X1061:$i]:(in @ X1061 @ nat=>(X1059)!=(n_pl @ X1053 @ X1061)))=>(![X1060:$i]:(in @ X1060 @ nat=>(X1059)!=(n_pl @ (n_pl @ X1053 @ n_1) @ X1060))=>(X1059)=(n_pl @ X1053 @ n_1)))))), inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[satz25]), c_0_29]), c_0_39]), c_0_42])])).
108.11/108.56	thf(c_0_48, plain, ![X2702:$i, X2703:$i]:((ordsucc @ X2702)!=(ordsucc @ X2703)|(X2702)=(X2703)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_43])])).
108.11/108.56	thf(c_0_49, plain, ![X2930:$i]:((in @ (esk43_1 @ X2930) @ nat|(X2930)=(n_1)|~in @ X2930 @ nat)&((X2930)=(ordsucc @ (esk43_1 @ X2930))|(X2930)=(n_1)|~in @ X2930 @ nat)), inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_44])])])])).
108.11/108.56	thf(c_0_50, plain, ![X2355:$i]:(in @ X2355 @ nat=>((X2355)!=(n_1)=>~((![X2361:$i]:(in @ X2361 @ nat=>![X2362:$i]:(in @ X2362 @ nat=>((X2355)=(ordsucc @ X2361)=>((X2355)=(ordsucc @ X2362)=>(X2361)=(X2362)))))=>![X2363:$i]:(in @ X2363 @ nat=>(X2355)!=(ordsucc @ X2363)))))), inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[satz3a, c_0_29]), c_0_32]), c_0_40]), c_0_45])])).
108.11/108.56	thf(c_0_51, plain, ![X3015:$i]:(~in @ X3015 @ nat|(ordsucc @ X3015)=(n_pl @ X3015 @ n_1)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_46])])).
108.11/108.56	thf(c_0_52, negated_conjecture, ![X2961:$i]:(in @ esk49_0 @ nat&(in @ esk50_0 @ nat&((in @ esk51_0 @ nat&(esk50_0)=(n_pl @ esk49_0 @ esk51_0))&((~in @ X2961 @ nat|(esk50_0)!=(n_pl @ (n_pl @ esk49_0 @ n_1) @ X2961))&(esk50_0)!=(n_pl @ esk49_0 @ n_1))))), inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_47])])])])).
108.11/108.56	thf(c_0_53, plain, ![X1944:$i]:(in @ X1944 @ nat=>![X1948:$i]:(in @ X1948 @ nat=>(ordsucc @ (n_pl @ X1944 @ X1948))=(n_pl @ X1944 @ (ordsucc @ X1948)))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[satz4f, c_0_29]), c_0_32])).
108.11/108.56	thf(c_0_54, plain, ![X1860:$i]:(in @ X1860 @ nat=>![X1864:$i]:(in @ X1864 @ nat=>(ordsucc @ (n_pl @ X1860 @ X1864))=(n_pl @ (ordsucc @ X1860) @ X1864))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[satz4h, c_0_29]), c_0_32])).
108.11/108.56	thf(c_0_55, plain, ![X1:$i, X4:$i]:((X1)=(X4)|(ordsucc @ X1)!=(ordsucc @ X4)), inference(split_conjunct,[status(thm)],[c_0_48])).
108.11/108.56	thf(c_0_56, plain, ![X1:$i]:((X1)=(ordsucc @ (esk43_1 @ X1))|(X1)=(n_1)|~in @ X1 @ nat), inference(split_conjunct,[status(thm)],[c_0_49])).
108.11/108.56	thf(c_0_57, plain, ![X3188:$i, X3189:$i, X3190:$i]:((~in @ X3189 @ nat|(~in @ X3190 @ nat|((X3188)!=(ordsucc @ X3189)|((X3188)!=(ordsucc @ X3190)|(X3189)=(X3190))))|(X3188)=(n_1)|~in @ X3188 @ nat)&((in @ (esk94_1 @ X3188) @ nat|(X3188)=(n_1)|~in @ X3188 @ nat)&((X3188)=(ordsucc @ (esk94_1 @ X3188))|(X3188)=(n_1)|~in @ X3188 @ nat))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_50])])])])])).
108.11/108.56	thf(c_0_58, plain, ![X1444:$i]:(in @ X1444 @ nat=>![X1448:$i]:(in @ X1448 @ nat=>(n_pl @ X1444 @ X1448)=(n_pl @ X1448 @ X1444))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[satz6, c_0_29]), c_0_32])).
108.11/108.56	thf(c_0_59, plain, ![X1:$i]:((ordsucc @ X1)=(n_pl @ X1 @ n_1)|~in @ X1 @ nat), inference(split_conjunct,[status(thm)],[c_0_51])).
108.11/108.56	thf(c_0_60, negated_conjecture, in @ esk49_0 @ nat, inference(split_conjunct,[status(thm)],[c_0_52])).
108.11/108.56	thf(c_0_61, plain, ![X3116:$i, X3117:$i]:(~in @ X3116 @ nat|(~in @ X3117 @ nat|(ordsucc @ (n_pl @ X3116 @ X3117))=(n_pl @ X3116 @ (ordsucc @ X3117)))), inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_53])])])).
108.11/108.56	thf(c_0_62, plain, ![X3098:$i, X3099:$i]:(~in @ X3098 @ nat|(~in @ X3099 @ nat|(ordsucc @ (n_pl @ X3098 @ X3099))=(n_pl @ (ordsucc @ X3098) @ X3099))), inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_54])])])).
108.11/108.56	thf(c_0_63, plain, ![X1:$i]:((esk43_1 @ (ordsucc @ X1))=(X1)|(ordsucc @ X1)=(n_1)|~in @ (ordsucc @ X1) @ nat), inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_55, c_0_56])])).
108.11/108.56	thf(c_0_64, plain, ![X1:$i]:((X1)=(ordsucc @ (esk94_1 @ X1))|(X1)=(n_1)|~in @ X1 @ nat), inference(split_conjunct,[status(thm)],[c_0_57])).
108.11/108.56	thf(c_0_65, plain, ![X3021:$i, X3022:$i]:(~in @ X3021 @ nat|(~in @ X3022 @ nat|(n_pl @ X3021 @ X3022)=(n_pl @ X3022 @ X3021))), inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_58])])])).
108.11/108.56	thf(c_0_66, negated_conjecture, ![X1:$i]:(~in @ X1 @ nat|(esk50_0)!=(n_pl @ (n_pl @ esk49_0 @ n_1) @ X1)), inference(split_conjunct,[status(thm)],[c_0_52])).
108.11/108.56	thf(c_0_67, negated_conjecture, (n_pl @ esk49_0 @ n_1)=(ordsucc @ esk49_0), inference(spm,[status(thm)],[c_0_59, c_0_60])).
108.11/108.56	thf(c_0_68, plain, ![X1:$i, X4:$i]:((ordsucc @ (n_pl @ X1 @ X4))=(n_pl @ X1 @ (ordsucc @ X4))|~in @ X1 @ nat|~in @ X4 @ nat), inference(split_conjunct,[status(thm)],[c_0_61])).
108.11/108.56	thf(c_0_69, plain, ![X1:$i, X4:$i]:((ordsucc @ (n_pl @ X1 @ X4))=(n_pl @ (ordsucc @ X1) @ X4)|~in @ X1 @ nat|~in @ X4 @ nat), inference(split_conjunct,[status(thm)],[c_0_62])).
108.11/108.56	thf(c_0_70, plain, ![X1:$i]:((esk94_1 @ X1)=(esk43_1 @ X1)|(X1)=(n_1)|~in @ X1 @ nat), inference(spm,[status(thm)],[c_0_63, c_0_64])).
108.11/108.56	thf(c_0_71, negated_conjecture, in @ esk51_0 @ nat, inference(split_conjunct,[status(thm)],[c_0_52])).
108.11/108.56	thf(c_0_72, plain, ![X1374:$i]:(in @ X1374 @ nat=>(ordsucc @ X1374)=(n_pl @ n_1 @ X1374)), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[satz4g, c_0_29]), c_0_32])).
108.11/108.56	thf(c_0_73, plain, ![X1:$i, X4:$i]:((n_pl @ X1 @ X4)=(n_pl @ X4 @ X1)|~in @ X1 @ nat|~in @ X4 @ nat), inference(split_conjunct,[status(thm)],[c_0_65])).
108.11/108.56	thf(c_0_74, negated_conjecture, ![X1:$i]:((n_pl @ (ordsucc @ esk49_0) @ X1)!=(esk50_0)|~in @ X1 @ nat), inference(rw,[status(thm)],[c_0_66, c_0_67])).
108.11/108.56	thf(c_0_75, plain, ![X4:$i, X1:$i]:((n_pl @ (ordsucc @ X1) @ X4)=(n_pl @ X1 @ (ordsucc @ X4))|~in @ X4 @ nat|~in @ X1 @ nat), inference(spm,[status(thm)],[c_0_68, c_0_69])).
108.11/108.56	thf(c_0_76, negated_conjecture, ((esk94_1 @ esk51_0)=(esk43_1 @ esk51_0)|(esk51_0)=(n_1)), inference(spm,[status(thm)],[c_0_70, c_0_71])).
108.11/108.56	thf(c_0_77, plain, ![X1:$i]:(in @ (esk94_1 @ X1) @ nat|(X1)=(n_1)|~in @ X1 @ nat), inference(split_conjunct,[status(thm)],[c_0_57])).
108.11/108.56	thf(c_0_78, plain, ![X3016:$i]:(~in @ X3016 @ nat|(ordsucc @ X3016)=(n_pl @ n_1 @ X3016)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_72])])).
108.11/108.57	thf(c_0_79, negated_conjecture, ![X1:$i]:((n_pl @ X1 @ esk51_0)=(n_pl @ esk51_0 @ X1)|~in @ X1 @ nat), inference(spm,[status(thm)],[c_0_73, c_0_71])).
108.11/108.57	thf(c_0_80, negated_conjecture, (esk50_0)=(n_pl @ esk49_0 @ esk51_0), inference(split_conjunct,[status(thm)],[c_0_52])).
108.11/108.57	thf(c_0_81, negated_conjecture, ![X1:$i]:((n_pl @ esk49_0 @ (ordsucc @ X1))!=(esk50_0)|~in @ X1 @ nat), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_74, c_0_75]), c_0_60])])).
108.11/108.57	thf(c_0_82, negated_conjecture, ((ordsucc @ (esk43_1 @ esk51_0))=(esk51_0)|(esk51_0)=(n_1)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_64, c_0_76]), c_0_71])])).
108.11/108.57	thf(c_0_83, negated_conjecture, ((esk51_0)=(n_1)|in @ (esk43_1 @ esk51_0) @ nat), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_77, c_0_76]), c_0_71])])).
108.11/108.57	thf(c_0_84, plain, ![X1:$i]:((ordsucc @ X1)=(n_pl @ n_1 @ X1)|~in @ X1 @ nat), inference(split_conjunct,[status(thm)],[c_0_78])).
108.11/108.57	thf(c_0_85, negated_conjecture, (esk50_0)!=(n_pl @ esk49_0 @ n_1), inference(split_conjunct,[status(thm)],[c_0_52])).
108.11/108.57	thf(c_0_86, negated_conjecture, (n_pl @ esk51_0 @ esk49_0)=(esk50_0), inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_79, c_0_60]), c_0_80])).
108.11/108.57	thf(c_0_87, negated_conjecture, (esk51_0)=(n_1), inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_81, c_0_82]), c_0_80])]), c_0_83])).
108.11/108.57	thf(c_0_88, negated_conjecture, (n_pl @ n_1 @ esk49_0)=(ordsucc @ esk49_0), inference(spm,[status(thm)],[c_0_84, c_0_60])).
108.11/108.57	thf(c_0_89, negated_conjecture, (ordsucc @ esk49_0)!=(esk50_0), inference(rw,[status(thm)],[c_0_85, c_0_67])).
108.11/108.57	thf(c_0_90, negated_conjecture, ($false), inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_86, c_0_87]), c_0_88]), c_0_89]), ['proof']).
108.11/108.57	# SZS output end CNFRefutation
108.11/108.57	# Proof object total steps             : 91
108.11/108.57	# Proof object clause steps            : 29
108.11/108.57	# Proof object formula steps           : 62
108.11/108.57	# Proof object conjectures             : 20
108.11/108.57	# Proof object clause conjectures      : 17
108.11/108.57	# Proof object formula conjectures     : 3
108.11/108.57	# Proof object initial clauses used    : 14
108.11/108.57	# Proof object initial formulas used   : 28
108.11/108.57	# Proof object generating inferences   : 12
108.11/108.57	# Proof object simplifying inferences  : 16
108.11/108.57	# Training examples: 0 positive, 0 negative
108.11/108.57	# Parsed axioms                        : 401
108.11/108.57	# Removed by relevancy pruning/SinE    : 0
108.11/108.57	# Initial clauses                      : 633
108.11/108.57	# Removed in clause preprocessing      : 169
108.11/108.57	# Initial clauses in saturation        : 464
108.11/108.57	# Processed clauses                    : 6766
108.11/108.57	# ...of these trivial                  : 263
108.11/108.57	# ...subsumed                          : 2252
108.11/108.57	# ...remaining for further processing  : 4251
108.11/108.57	# Other redundant clauses eliminated   : 2701
108.11/108.57	# Clauses deleted for lack of memory   : 0
108.11/108.57	# Backward-subsumed                    : 8
108.11/108.57	# Backward-rewritten                   : 1455
108.11/108.57	# Generated clauses                    : 118836
108.11/108.57	# ...of the previous two non-trivial   : 116207
108.11/108.57	# Contextual simplify-reflections      : 48
108.11/108.57	# Paramodulations                      : 109590
108.11/108.57	# Factorizations                       : 0
108.11/108.57	# NegExts                              : 100
108.11/108.57	# Equation resolutions                 : 2716
108.11/108.57	# Propositional unsat checks           : 0
108.11/108.57	#    Propositional check models        : 0
108.11/108.57	#    Propositional check unsatisfiable : 0
108.11/108.57	#    Propositional clauses             : 0
108.11/108.57	#    Propositional clauses after purity: 0
108.11/108.57	#    Propositional unsat core size     : 0
108.11/108.57	#    Propositional preprocessing time  : 0.000
108.11/108.57	#    Propositional encoding time       : 0.000
108.11/108.57	#    Propositional solver time         : 0.000
108.11/108.57	#    Success case prop preproc time    : 0.000
108.11/108.57	#    Success case prop encoding time   : 0.000
108.11/108.57	#    Success case prop solver time     : 0.000
108.11/108.57	# Current number of processed clauses  : 2659
108.11/108.57	#    Positive orientable unit clauses  : 485
108.11/108.57	#    Positive unorientable unit clauses: 5
108.11/108.57	#    Negative unit clauses             : 1085
108.11/108.57	#    Non-unit-clauses                  : 1084
108.11/108.57	# Current number of unprocessed clauses: 108463
108.11/108.57	# ...number of literals in the above   : 484969
108.11/108.57	# Current number of archived formulas  : 0
108.11/108.57	# Current number of archived clauses   : 1466
108.11/108.57	# Clause-clause subsumption calls (NU) : 227828
108.11/108.57	# Rec. Clause-clause subsumption calls : 78234
108.11/108.57	# Non-unit clause-clause subsumptions  : 457
108.11/108.57	# Unit Clause-clause subsumption calls : 297564
108.11/108.57	# Rewrite failures with RHS unbound    : 5
108.11/108.57	# BW rewrite match attempts            : 559
108.11/108.57	# BW rewrite match successes           : 90
108.11/108.57	# Condensation attempts                : 0
108.11/108.57	# Condensation successes               : 0
108.11/108.57	# Termbank termtop insertions          : 2642029
108.11/108.58	
108.11/108.58	# -------------------------------------------------
108.11/108.58	# User time                : 105.074 s
108.11/108.58	# System time              : 2.890 s
108.11/108.58	# Total time               : 107.964 s
108.11/108.58	# Maximum resident set size: 2320 pages
108.11/108.58	EOF